NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
31	Finding Common Structured Patterns in Linear Graphs ? Guillaume Fertin LINA, CNRS UMR 6241, Universit´e de Nantes, 2 rue de la Houssini`ere, 44322 Nantes, France Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2011-04-27 05:27:10 Graph theory Graph coloring NP-complete problems Matroid theory Graph Matching Ear decomposition Pathwidth Independent set
32	On Local Fixing Michael K¨onig and Roger Wattenhofer Computer Engineering and Networks Laboratory, ETH Zurich, 8092 Zurich, Switzerland {mikoenig, wattenhofer}@ethz.ch Fax: + Add to Reading List Source URL: www.tik.ee.ethz.ch Language: English - Date: 2015-05-18 12:16:02 Graph theory Mathematics Computational complexity theory NP-complete problems Spanning tree Combinatorial optimization Maximal independent set Matching Connectivity Vertex cover Minimum spanning tree Leader election
33	Moment methods in extremal geometry David de Laat Delft University of Technology (Joint with Fernando Oliveira and Frank Vallentin) 51st Dutch Mathematical Congress Add to Reading List Source URL: www.daviddelaat.nl Language: English Mathematics Geometry Discrete geometry NP-complete problems Circle packing Conjectures Operations research Sphere packing Independent set Tammes problem Kepler conjecture Semidefinite programming
34	–Independent Work Report Spring,2014– Exploring Self-Organizing Learning Groups in an Online Learning Platform: Classroom Salon Brandon Lam Advisor: Dr. Ananda Gunawardena Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2014-05-16 16:36:56 Graph theory Computational linguistics Mathematics NP-complete problems Knowledge representation Open data Thesauri WordNet Clique Word square
35	A Polynomial-Time Approximation Scheme for Maximum Quartet Compatibility Add to Reading List Source URL: tandy.cs.illinois.edu Language: English - Date: 2015-04-08 19:35:45 Computational complexity theory Theory of computation Complexity classes NP-complete problems Combinatorial optimization Packing problems Approximation algorithms Knapsack problem NP APX
36	Although the result is correct, the algorithm and analysis presented in this paper contain non-trivial errors. These have been fixed in a technical report (availabe at http://www.disco.ethz.ch/publications/planarmds_-1.p Add to Reading List Source URL: disco.ethz.ch Language: English - Date: 2014-09-26 08:36:22 Graph theory NP-complete problems Maximal independent set Independent set Dominating set Vertex cover Graph coloring Planar graph Graph minor Planar separator theorem Tree decomposition
37	A. Daneshgar: Extended abstract of my talk at IUTFebruaryDo Graphs Admit Topological Field Theories? Amir Daneshgar Add to Reading List Source URL: sharif.ir Language: English - Date: 2013-10-17 07:17:33 Graph theory Mathematics Graph operations NP-complete problems Graph coloring Topological graph theory Line graph Graph homomorphism Graph Graph property Signed graph
38	Online Matching: Haste makes Waste! (Full Version)∗ Yuval Emek† Shay Kutten‡ Add to Reading List Source URL: www.tik.ee.ethz.ch Language: English - Date: 2016-06-22 05:23:03 Graph theory Mathematics Computational complexity theory NP-complete problems Matching Combinatorial optimization Dominating set Vertex cover Transportation theory Distribution
39	TSPLIB in XML format To facilitate the usage of the classical TSPLIB by Gerhard Reinelt, we now offer the data of the well-known test instances also in an XML data format, both for the symmetric and the asymmetric travel Add to Reading List Source URL: www.iwr.uni-heidelberg.de Language: English - Date: 2013-06-19 04:16:58 Graph theory Mathematics Computational complexity theory NP-complete problems Graph Travelling salesman problem Vertex Cycle Hamiltonian path Graph automorphism Vertex cover
40	1 Optimizing Busy Time on Parallel Machines George B. Mertzios∗ , Mordechai Shalom† , Ariella Voloshin‡ , Prudence W.H. Wong§ and Shmuel Zaks‡ ∗ School of Engineering and Computing Sciences, Durham University Add to Reading List Source URL: cgi.csc.liv.ac.uk Language: English - Date: 2012-02-08 11:20:14 Graph theory Mathematics Operations research Mathematical optimization NP-complete problems Dynamic programming Equations Systems engineering Independent set Interval scheduling Interval graph Approximation algorithm

UPDATE